例句與造句

1. On a logarithmic time scale a step lasts ten times longer than the previous step.
2. Purely functional data structures are often represented in a different way than their logarithmic time.
3. Specifically, these last two operations can be implemented respectively in constant and logarithmic time.
4. These stable statistical relationships exist specifically for double-logarithmic time intervals and for the density increase.
5. This allows LCA queries to be carried out in logarithmic time in the height of the tree.
6. It's difficult to find logarithmic time in a sentence. 用logarithmic time造句挺難的
7. FO ( BIT ) is the restriction of AC 0 family of circuit constructible in alternating logarithmic time.
8. Binary search functions, for example, have a maximum complexity of O ( log ( n ) ), or logarithmic time.
9. These more relaxed invariants allow Conc-trees to retain logarithmic time concatenation, while random access lists allow only O ( n ) concatenation.
10. If the database entries were encrypted with a deterministic scheme and sorted, then a specific field of the database could be retrieved in logarithmic time.
11. A less trivial example is a representing a sorted list by a " sorted array ", which allows search in logarithmic time by binary search.
12. It follows that within logarithmic time in the size of the network ( the number of agents ), any new search string will have reached all agents.
13. Point in polygon queries with respect to a monotone polygon may be answered in logarithmic time after linear time preprocessing ( to find the leftmost and rightmost vertices ).
14. By following successors computed for other vertices, the traversal down each path can be doubled every iteration, which means that the tree roots can be found in logarithmic time.
15. Compared with the actual numbers being added ( in the billions ), the algorithm could be called " pseudo-logarithmic time ", though such a term is not standard.
16. Bipartite maximum matchings can be approximated arbitrarily accurately in constant time by distributed algorithms; in contrast, approximating the minimum vertex cover of a bipartite graph requires at least logarithmic time.
更多例句：  下一頁(yè)